Induction time of a polymorphic transformation
نویسندگان
چکیده
منابع مشابه
A polymorphic representation of induction-recursion
The family T ∗ does not depend on the function g∗, because all calls to it have been replaced by f , and is not inductive, because all recursive occurrences of T in the constructors have been replaced by Y . Therefore, the definition is a standard polymorphic definition in the Calculus of Inductive Constructions and g∗ is a standard function on it defined by case analysis. However, we have enla...
متن کاملPolymorphic Single-Pushout Graph Transformation
Impressum Forschungsberichte der FHDW Hannover – Veröffentlichungen aus dem Bereich Forschung und Entwicklung der FHDW Hannover. Abstract. The paper extends single-pushout graph transformation by poly-morphism, a key concept in object-oriented design. The notions sub-rule and remainder, well-known in single-pushout rewriting, are applied to model dynamic rule extension and type dependent rule a...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولMonitoring real time polymorphic transformation of sulfanilamide by diffuse reflectance visible spectroscopy☆
This study investigated the development of a novel approach to surface characterization of drug polymorphism and the extension of the capabilities of this method to perform 'real time' in situ measurements. This was achieved using diffuse reflectance visible (DRV) spectroscopy and dye deposition, using the pH sensitive dye, thymol blue (TB). Two polymorphs, SFN-β and SFN-γ, of the drug substanc...
متن کاملPolymorphic Binding-Time Analysis
Binding time analysis is an important part of off-line partial evaluation, annotating expressions as being safely evaluable from known data or possibly depending on unknown data. Most binding-time analyses have been monovariant, allowing only one binding-time description for each function. The idea of polyvariance is to allow multiple binding time descriptions of each function, by duplicating t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CrystEngComm
سال: 2017
ISSN: 1466-8033
DOI: 10.1039/c7ce00766c